Accelerating local search algorithms for the travelling salesman problem through the effective use of GPU
نویسندگان
چکیده
منابع مشابه
Genetic Local Search Algorithms for the Travelling Salesman Problem
We briefly review previous attempts to generate near-optimal solutions of the Traveling Salesman Problem by applying Genetic Algorithms. Following the lines of Johnson [1990] we discuss some possibilities for speeding up classical Local Search algorithms by casting them into a genetic frame. In an experimental study two such approaches, viz. Genetic Local Search with 2-Opt neighbourhoods and Li...
متن کاملParallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem
The purpose of this paper is to propose effective parallelization strategies for the Iterated Local Search (ILS) metaheuristic on Graphics Processing Units (GPU). We consider the decomposition of the 3-opt Local Search procedure on the GPU processing hardware and memory structure. Two resulting algorithms are evaluated and compared on both speedup and solution quality on a state-of-the-art Ferm...
متن کاملA Gpu Implementation of Local Search Operators for Symmetric Travelling Salesman Problem
The Travelling Salesman Problem (TSP) is one of the most studied combinatorial optimization problem which is significant in many practical applications in transportation field. The TSP is an NP-hard problem and requires large computational power to be optimally solved by exact algorithms. In the past few years, fast development of generalpurpose Graphics Processing Units (GPUs) has brought huge...
متن کاملAccelerating ant colony optimisation for the travelling salesman problem on the GPU
Recent Graphics Processing Units (GPUs) can be used for general purpose parallel computation. Ant Colony Optimization (ACO) approaches have been introduced as nature-inspired heuristics to find good solutions of the Traveling Salesman Problem (TSP). In ACO approaches, a number of ants traverse the cities of the TSP to find better solutions of the TSP. The ants randomly select next visiting citi...
متن کاملEffective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem
In this paper we present effective new local and variable neighbourhood search heuristics for the asymmetric Travelling Salesman Problem. Our local search approach, HyperOpt, is inspired by a heuristic developed for a sequencing problem arising in the manufacture of printed circuit boards. In our approach we embed an exact algorithm into a local search heuristic in order to exhaustively search ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Procedia
سال: 2017
ISSN: 2352-1465
DOI: 10.1016/j.trpro.2017.03.012